-calculi with Explicit Substitutions and Composition Which Preserve -strong Normalization (extended Abstract)
نویسندگان
چکیده
We study preservation of-strong normalization by d and dn, two connuent-calculi with explicit substitutions deened in 10]; the par-ticularity of these calculi is that both have a composition operator for substitutions. We develop an abstract simulation technique allowing to reduce preservation of-strong normalization of one calculus to that of another one, and apply said technique to reduce preservation of-strong normaliza-tion of d and dn to that of f, another calculus having no composition operator. Then, preservation of-strong normalization of f is shown using the same technique as in 2]. As a consequence, d and dn become the rst-calculi with explicit substitutions having composition and preserving-strong normalization. We also apply our technique to reduce preservation of-strong normalization of the calculus in 14] to that of f.
منابع مشابه
-calculi with Explicit Substitutions and Weak Composition Which Preserve -strong Normalization
This paper studies preservation of-strong normalization by two diierent connuent-calculi with explicit substitutions deened in Kes96]; the particularity of these calculi, called d and dn respectively, is that both have a (weak) composition operator for substitutions. We develop an abstract simulation technique allowing to reduce preservation of-strong normalization of one calculus to that of an...
متن کاملA Theory of Explicit Substitutions with Safe and Full Composition
Many different systems with explicit substitutions have been proposed to implement a large class of higher-order languages. Motivations and challenges that guided the development of such calculi in functional frameworks are surveyed in the first part of this paper. Then, very simple technology in named variable-style notation is used to establish a theory of explicit substitutions for the lambd...
متن کاملStrong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets (Extended Abstract)
In this paper, we show the correspondence existing between normalization in calculi with explicit substitution and cut elimination in sequent calculus for Linear Logic, via Proof Nets. This correspondence allows us to prove that a typed version of the λx-calculus [30, 29] is strongly normalizing, as well as of all the calculi isomorphic to it such as λυ [24], λs [19], λd [21], and λf [11]. In o...
متن کاملA Calculus of Explicit Substitutions Which Preserves Strong Normalisation , a Calculus of Explicit Substitutions Which Preserves Strong Normalisation
Explicit substitutions were proposed by Abadi, Cardelli, Curien, Hardin and LLvy to internalise substitutions into-calculus and to propose a mechanism for computing on substitutions. is another view of the same concept which aims to explain the process of substitution and to decompose it in small steps. is simple and preserves strong normalisation. Apparently that important property cannot stay...
متن کاملStrong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets
In this paper, we show the correspondence existing between normalization in calculi with explicit substitution and cut elimination in sequent calculus for Linear Logic,via Proof Nets. This correspondence allows us to prove that a typed version of the λx-calculus [34, 5] is strongly normalizing, as well as of all the calculi that can be translated to it keeping normalization properties such as λ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996